- beta cutoff
- 【智】β修剪，β载止
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
beta cutoff
Look at other dictionaries:
Beta-glucan — Diagram showing orientation and location of different beta glucan linkages … Wikipedia
Alpha-Beta-Suche — Die Alpha Beta Suche, auch Alpha Beta Cut oder Alpha Beta Pruning genannt, ist eine optimierte Variante des Minimax Suchverfahrens, also eines Algorithmus zur Bestimmung eines optimalen Zuges bei Spielen mit zwei gegnerischen Parteien. Während… … Deutsch Wikipedia
Alpha-beta pruning — is a search algorithm which seeks to reduce the number of nodes that are evaluated in the search tree by the minimax algorithm. It is a search with adversary algorithm used commonly for machine playing of two player games (Tic tac toe, Chess, Go … Wikipedia
International Space Station — ISS redirects here. For other uses, see ISS (disambiguation). International Space Station … Wikipedia
Renormalization — Quantum field theory (Feynman diagram) … Wikipedia
Renormalization group — In theoretical physics, the renormalization group (RG) refers to a mathematical apparatus that allows systematic investigation of the changes of a physical system as viewed at different distance scales. In particle physics, it reflects the… … Wikipedia
Bremsstrahlung — produced by a high energy electron deflected in the electric field of an atomic nucleus Bremsstrahlung (German pronunciation: [ˈbʁɛmsˌʃtʁaːlʊŋ] ( … Wikipedia
Non-Radiative Dielectric waveguide (NRD) — Figure 1 Contents 1 Introduction 2 The dispersion relation in the NRD wave … Wikipedia
Null-move heuristic — In computer chess programs, the null move heuristic is a heuristic technique used to enhance the speed of the alpha beta pruning algorithm. Contents 1 Rationale 2 Implementation 3 Problems with the null move heuristic … Wikipedia
Chebyshev filter — Linear analog electronic filters Network synthesis filters Butterworth filter Chebyshev filter Elliptic (Cauer) filter Bessel filter Gaussian filter Optimum L (Legendre) filter Linkwitz Riley filter … Wikipedia
Killer heuristic — In competitive two player games, the killer heuristic is a technique for improving the efficiency of alpha beta pruning, which in turn improves the efficiency of the minimax algorithm. This algorithm has an exponential search time to find the… … Wikipedia
